84f8f792f383059ba97957ac5543a1e549f55b1a,src/com/jwetherell/algorithms/mathematics/RamerDouglasPeucker.java,RamerDouglasPeucker,douglasPeucker,#List#number#number#number#,42
Before Change
final List<Double[]> resultList;
if (dmax > epsilon) {
// Recursive call
final List<Double[]> recResults1 = douglasPeucker(list, s, index, epsilon);
final List<Double[]> recResults2 = douglasPeucker(list, index, e, epsilon);
// Build the result list
After Change
// If max distance is greater than epsilon, recursively simplify
if (dmax > epsilon) {
// Recursive call
douglasPeucker(list, s, index, epsilon, resultList);
douglasPeucker(list, index, e, epsilon, resultList);
} else {
if ((end-start)>0) {